Generating negations of probability distributions

نویسندگان

چکیده

Recently, the notation of a negation probability distribution was introduced. The need for such arises when knowledge-based system can use terms like NOT HIGH, where HIGH is represented by (pd). For example, PROFIT or PRICE be considered. application this in Dempster–Shafer theory considered many works. Although several negations distributions have been proposed, it not clear how to construct other negations. In paper, we consider as point-by-point transformations pd using decreasing functions defined on [0,1] called negators. We propose general method generation negators and corresponding pd, study their properties. give characterization linear convex combination Yager’s uniform

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some New Weighted Information Generating Functions of Discrete Probability Distributions

The aim of this paper is to introduce some new information generating functions with utilities whose derivatives give some well known measures of information. Some properties and particular cases of the proposed functions have also been studied. Mathematics Subject Classification 2000: 94A15, 94A17 Additional

متن کامل

A New Weighted Information Generating Function for Discrete Probability Distributions

The object of this paper is to introduce a new weighted information generating function whose derivative at point 1 gives some well known measures of information. Some properties and particular cases of the proposed generating function have also been studied.

متن کامل

Notes on Generating Probability Distributions for a given Entropy value

1 Motivation The goal is to develop an algorithm for creating a probability distribution that results in a given entropy value. Ideally, the algorithm should be able to generate all possible probability distributions, with the same probability. Nevertheless, since it is not trivial to guarantee this property, we will insert some randomness to our algorithm to ensure some variation in the results.

متن کامل

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...

متن کامل

Generating Explanation Trees even for Negations in Deductive DataBase Systems

Although there were enormous research efforts on explanation and debugging tools for Prolog in the last years, good tools for bottom-up evaluating logic programming systems are still missing, since the generation of the underlying proof trees matches several problems in presence of negation and recursion. This paper wants to fill the gap and presents a source-to-source transformation to compute...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2021

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-021-05802-5